Approximating Full Conformal Prediction at Scale via Influence Functions
نویسندگان
چکیده
Conformal prediction (CP) is a wrapper around traditional machine learning models, giving coverage guarantees under the sole assumption of exchangeability; in classification problems, CP that error rate at most chosen significance level, irrespective whether underlying model misspecified. However, prohibitive computational costs full led researchers to design scalable alternatives, which alas do not attain same or statistical power CP. In this paper, we use influence functions efficiently approximate We prove our method consistent approximation CP, and empirically show becomes smaller as training set increases; e.g., for 1,000 points two methods output p-values are
منابع مشابه
Approximating the Influence of Monotone Boolean Functions
The Total Influence (Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function f : {0, 1} → {0, 1}, which we denote by I[f ]. We present a randomized algorithm that approximates the influence of such functions to within a multiplicative factor of (1 ± ) by performing O (√ n log n I[f ]...
متن کاملApproximating Game-Theoretic Optimal Strategies for Full-scale Poker
The computation of the first complete approximations of game-theoretic optimal strategies for fullscale poker is addressed. Several abstraction techniques are combined to represent the game of 2player Texas Hold’em, having size , using closely related models each having size . Despite the reduction in size by a factor of 100 billion, the resulting models retain the key properties and structure ...
متن کاملApproximating separable nonlinear functions via mixed zero-one programs
We discuss two models from the literature that have been developed to formulate piecewise linear approximations of separable nonlinear functions by way of mixed-integer programs. We show that the most commonly proposed method is computationally inferior to a lesser known technique by comparing analytically the linear programming relaxations of the two formulations. A third way of formulating th...
متن کاملGreen's Functions for Multiply Connected Domains via Conformal Mapping
A method is described for the computation of the Green’s function in the complex plane corresponding to a set of K symmetrically placed polygons along the real axis. An important special case is a set of K real intervals. The method is based on a Schwarz–Christoffel conformal map of the part of the upper half-plane exterior to the problem domain onto a semi-infinite strip whose end contains K −...
متن کاملError bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i6.25814